public class MyCircularQueue {
    public int[] elem;
    public int usedSize;

    public int ftont;
    public int rear;

    public MyCircularQueue(int k) {
        elem = new int[k];
    }


    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1) % elem.length;
        usedSize++;
        return true;
    }

    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        ftont = (ftont + 1) % elem.length;
        usedSize--;
        return true;
    }

    //获取队头元素
    public int Front() {
        if(isEmpty()){
            return -1;
        }
        return elem[ftont];
    }
    //获取队尾元素
    public int Rear() {
        if(isEmpty()){
            return -1;
        }
        int index = (rear ==0) ? elem.length - 1 : rear - 1;
        return elem[index];
    }

    public boolean isEmpty() {
        return usedSize == 0;
    }

    public boolean isFull() {
        return usedSize == elem.length;
    }
}
